Optimal Clock Allocation for Synthesized Acyclic Timed Automata
نویسنده
چکیده
Having recently proposed a new method for synthesizing timed automata from a set of scenarios, in this paper we propose a novel clock allocation algorithm that minimizes the number of clocks in the constructed timed automata. Scenarios, formally defined as Timed Event Sequences, together with mode graphs are used to describe partial behaviors of real-time systems. Given a set of scenarios in the form of Timed Event Sequences and a mode graph, our synthesis method constructs a minimal, deterministic, acyclic timed automaton, with a minimal num-
منابع مشابه
Job-Shop Scheduling Using Timed Automata
In this paper we show how the classical job shop scheduling problem can be modeled as a special class of acyclic timed automata Finding an optimal schedule corresponds then to nding a shortest in terms of elapsed time path in the timed automaton This representa tion provides new techniques for solving the optimization problem and more importantly it allows to model naturally more complex dynami...
متن کاملOptimal Clock Allocation for a Class of Timed Automata
We address the problem of allocating a minimal number of clocks to timed automata. To make the problem tractable we assume that all locations are reachable. We identify a fairly general class of timed automata, TADS , for which there is an algorithm whose complexity is quadratic in the size of the graph.
متن کاملSimple Priced Timed Games are not That Simple
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a state and executing an action, respectively). The goals of the players are to minimise and maximise the cost to reach a target location, respectively. We consider priced timed games with one clock and arbitrary (positiv...
متن کاملOptimal Strategies in Priced Timed Game Automata
Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove in addition that it is decida...
متن کاملAs Soon as Probable: Optimal Scheduling under Stochastic Uncertainty
In this paper we continue our investigation of stochastic (and hence dynamic) variants of classical scheduling problems. Such problems can be modeled as duration probabilistic automata (DPA), a well-structured class of acyclic timed automata where temporal uncertainty is interpreted as a bounded uniform distribution of task durations [18]. In [12] we have developed a framework for computing the...
متن کامل